Dynamic zoom simulations: A fast, adaptive algorithm for simulating light-cones

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments

Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...

متن کامل

A Fast Algorithm for Particle Simulations

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions are Coulombic or gravitational in nature. For a the form system of N pa...

متن کامل

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

A Fast Algorithm for Simulating the Chordal Schramm-Loewner Evolution

The Schramm-Loewner evolution (SLE) can be simulated by dividing the time interval into N subintervals and approximating the random conformal map of the SLE by the composition of N random, but relatively simple, conformal maps. In the usual implementation the time required to compute a single point on the SLE curve is O(N). We give an algorithm for which the time to compute a single point is O(...

متن کامل

A fast algorithm for simulating vesicle flows in three dimensions

Vesicles are locally-inextensible fluid membranes that can sustain bending. In this paper, we extend “A numerical method for simulating the dynamics of 3D axisymmetric vesicles suspended in viscous flows”, Veerapaneni et al. Journal of Computational Physics, 228(19), 2009 to general non-axisymmetric vesicle flows in three dimensions. Although the main components of the algorithm are similar in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 2020

ISSN: 0035-8711,1365-2966

DOI: 10.1093/mnras/staa2064